Optimal Tree Structures for Group Key Management with Batch Updates
نویسندگان
چکیده
منابع مشابه
Optimal Tree Structures for Group Key Management with Batch Updates
We investigate the key management problem for broadcasting applications. Previous work showed that batch rekeying can be more cost-effective than individual rekeying. Under the assumption that every user has probability p of being replaced by a new user during a batch rekeying period, we study the structure of the optimal key trees. Constant bounds on both the branching degree and the subtree s...
متن کاملApproximately Optimal Trees for Group Key Management with Batch Updates
We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effective than individual rekeying. One model for batch rekeying is to assume that every user has probability p of being replaced by a new user during a batch period with the total number of users unchanged. Under this model, it was r...
متن کاملOptimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost
We study the optimal structure for group broadcast problem where the key tree model is extensively used. The objective is usually to find an optimal key tree to minimize the cost based on certain assumptions. Under the assumption that n members arrive in the initial setup period and only member deletions are allowed after that period, previous works show that when only considering the deletion ...
متن کاملAsymptotically Optimal Tree-based Group Key Management Schemes
In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficiently. Selçuk and Sidhu have proposed an efficient scheme which updates dynamically the tree structures based on the withdrawal probabilities of members. In this paper, it is shown that Selçuk-Sidhu scheme is asymptotic...
متن کاملEfficient Batch Signature Generation Using Tree Structures
We propose an efficient batch signature generation scheme for signing multiple messages simultaneously. The scheme can be based on any signature scheme with appendix and resultant signatures preserve the property of independent verification by different recipients. The scheme is shown to be of almost constant complexity for both generation and verification as the number of messages increases wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2007
ISSN: 0895-4801,1095-7146
DOI: 10.1137/06064929x